Building a multicasting tree in a high-speed network

In this paper, we propose three strategies for building a multicasting tree in a high-speed network. These strategies can be used in any network topology. The rst one is based on voting, the second based on constructing a minimum spanning tree, and the third based on repeatedly constructing multiple minimum spanning trees. To demonstrate the eeectiveness of these strategies, we show how to apply them to hypercubes, star graphs, and star graphs with some faults. Experimental results are reported to evaluate the performance of these solutions.